Graphical Models for Minesweeper Project Report
نویسندگان
چکیده
Minesweeper is a popular single-person game that was invented in the 1970’s (Figure 1). A fixed number N of mines are randomly placed on a W ×H grid and are hidden from the player. The game begins with an empty field. The player opens (via clicking) one square at a time. If the square contains a mine then the player blows up and the game is over. Otherwise the square becomes uncovered containing a single value from 0 to 8. This value indicates the total number of mines adjacent (horizontally, vertically and diagonally) to that uncovered square. The aim of the game is to incrementally determine the location of all N mines without blowing up.
منابع مشابه
An Approximate Tensor-Based Inference Method Applied to the Game of Minesweeper
We propose an approximate probabilistic inference method based on the CP-tensor decomposition and apply it to the well known computer game of Minesweeper. In the method we view conditional probability tables of the exactly -out-of-k functions as tensors and approximate them by a sum of rank-one tensors. The number of the summands is min{l + 1, k − l + 1}, which is lower than their exact symmetr...
متن کاملMinesweeper, #minesweeper
We address the problem of finding an optimal policy for an agent playing the game of minesweeper. The problem is solved exactly, within the reinforcement learning framework, using a modified value iteration. Although it is a Partially Observable Markov Decision Problem (MDP), we show that, when using an appropriate state space, it can be defined and solved as a fully observable MDP. As has been...
متن کاملApplying Bayesian networks in the game of Minesweeper∗
We use the computer game of Minesweeper to illustrate few modeling tricks utilized when applying Bayesian network (BN) models in real applications. Among others, we apply rank-one decomposition (ROD) to conditional probability tables (CPTs) representing addition. Typically, this transformation helps to reduce the computational complexity of probabilistic inference with the BN model. However, in...
متن کاملMinesweeper on graphs
Minesweeper is a popular single player game. It has been shown that the Minesweeper consistency problem is NPcomplete and the Minesweeper counting problem is #P-complete. We present a polynomial algorithm for solving these problems for minesweeper graphs with bounded treewidth.
متن کاملPlaying the Minesweeper with Constraints
We present the design and implementation of a Minesweeper game, augmented with a digital assistant. The assistant uses contraint programming techniques to help the player, and is able to play the game by itself. It predicts safe moves, and gives probabilistic information when safe moves cannot be found.
متن کامل